0.935-Approximation Randomized Algorithm for MAX 2SAT and its Derandomization
نویسندگان
چکیده
In this paper, we propose 0.935-approximation algorithm for MAX 2SAT. The approximation ratio is better than the previously known result by Zwick, which is equal to 0.93109. The algorithm solves the SDP relaxation problem proposed by Goemans and Williamson for the first time. We do not use the ‘rotation’ technique proposed by Feige and Goemans. We improve the approximation ratio by using hyperplane separation technique with skewed distribution function on the sphere. We introduce a class of skewed distribution functions defined on the 2-dimensional sphere satisfying that for any function in the class, we can design a skewed distribution functions on any dimensional sphere without decreasing the approximation ratio. We also searched and found a good distribution function defined on the 2-dimensional sphere numerically. And we propose the derandomized algorithm for the introduced distribution functions.
منابع مشابه
New Approximation Algorithms for Max 2sat and Max Dicut
We propose a 0.935-approximation algorithm for MAX 2SAT and a 0.863-approximation algorithm for MAX DICUT. The approximation ratios improve upon the recent results of Zwick, which are equal to 0.93109 and 0.8596434254 respectively. Also proposed are derandomized versions of the same approximation ratios. We note that these approximation ratios are obtained by numerical computation rather than t...
متن کاملImproved Approximation Algorithms for Max-2SAT with Cardinality Constraint
The optimization problem Max-2SAT-CC is Max-2SAT with the additional cardinality constraint that the value one may be assigned to at most K variables. We present an approximation algorithm with polynomial running time for Max-2SAT-CC. This algorithm achieves, for any > 0, approximation ratio 6+3·e 16+2·e − ≈ 0.6603. Furthermore, we present a greedy algorithm with running time O(N logN) and appr...
متن کاملA Theorist’s Toolkit
(a) Show that, similarly to Max Cut, the Max 2SAT problem can be expressed as an integer quadratic program in which the only constraints are yi ∈ {1,−1} and the objective function is a quadratic in the yi. (Hint: It may help to introduce a variable y0 to designate which of 1 or −1 indicates “true”.) (b) Derive a factor αGW ≈ 0.87856 approximation algorithm for Max 2SAT. (c) Consider the restric...
متن کاملA 7/8-Approximation Algorithm for MAX 3SAT?
We describe a randomized approximation algorithm which takes an instance of MAX 3SAT as input. If the instance—a collection of clauses each of length at most three—is satisfiable, then the expected weight of the assignment found is at least 7=8 of optimal. We provide strong evidence (but not a proof) that the algorithm performs equally well on arbitrary MAX 3SAT instances. Our algorithm uses se...
متن کاملNote on MAX 2SAT
In this note we present an approximation algorithm for MAX 2SAT that given a (1− ε) satisfiable instance finds an assignment of variables satisfying a 1−O( √ ε) fraction of all constraints. This result is optimal assuming the Unique Games Conjecture. The best previously known result, due to Zwick, was 1−O(ε1/3). We believe that the analysis of our algorithm is much simpler than the analysis of ...
متن کامل